Applying Genetic Algorithm for Can-Order Policies in the Joint Replenishment Problem
نویسندگان
چکیده
منابع مشابه
A New Clustering Algorithm for Can-order Policies in Joint Replenishment Problem
A novel clustering algorithm is proposed and applied to the multi-item replenishment processing. This new algorithm has two distinguished features: non-binary hierarchical tree and the feature of overlapping clustering. A non-binary hierarchical tree is much smaller than the binary-trees constructed by most traditional algorithms and, therefore, it clearly highlights meaningful clusters which s...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولApplying Genetic Algorithm to Dynamic Layout Problem
In today’s economy, manufacturing plants must be able to operate efficiently and respond quickly to changes in the product mix and demand.[1] Layout design has a significant impact on manufacturing efficiency. Initially, it was treated as a static decision but due to improvements in technology, it is possible to rearrange the manufacturing facilities in different scenarios. The Plant layout...
متن کاملSimple Policies for Joint Replenishment Can Perform Badly
We consider the stochastic joint replenishment problem in which several items must be ordered in the face of stochastic demand. Previous authors proposed multiple heuristic policies for this economically-important problem. We show that several such policies are not good approximations to an optimal policy, since as some items grow more expensive than others, the cost rate of the heuristic polic...
متن کاملAn efficient algorithm for a generalized joint replenishment problem
In most multi-item inventory systems, the ordering costs consist of a major cost and a minor cost for each item included. Applying for every individual item a cyclic inventory policy, where the cycle length is a multiple of some basic cycle time, reduces the major ordering costs. An e cient algorithm to determine the optimal policy of this type is discussed in this paper. It is shown that this ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Industrial Engineering and Management Systems
سال: 2015
ISSN: 1598-7248
DOI: 10.7232/iems.2015.14.1.001